Solving scheduling problems by untimed model checking
نویسندگان
چکیده
منابع مشابه
Solving Scheduling Problems by
We deene a general methodology to deal with a large family of scheduling problems. We consider the case when some of the constraints are expressed through the minimization of a loss function. We study with more details a benchmark example consisting in some jigsaw puzzle problem with additional constraints. This is the occasion to discuss some algorithmic issues typical of scheduling problems, ...
متن کاملSolving Project Scheduling Problems by Minimum Cut Computations Solving Project Scheduling Problems by Minimum Cut Computations †
In project scheduling, a set of precedence-constrained jobs has to be scheduled so as to minimize a given objective. In resource-constrained project scheduling, the jobs additionally compete for scarce resources. Due to its universality, the latter problem has a variety of applications in manufacturing, production planning, project management, and elsewhere. It is one of the most intractable pr...
متن کاملOn Solving Flowshop Scheduling Problems
This paper proposes two variants of heuristic algorithms to solve the classic permutation flowshop scheduling problem. Both algorithms are simple and very efficient. The first algorithm is a constructive heuristic which builds the optimal schedule of jobs on the basis of a selective-greedy process. To escape the trap of local optimum points, for the second heuristic algorithm a stochastic featu...
متن کاملPRACTICAL PROBLEMS AND THE EFFICACY OF INTRAOSSEOUS INFUSION: SOLVING THE PROBLEMS BY EMPLOYING AN ANIMAL MODEL
In critically ill infants and children, intravascular (IV) access is sometimes very difficult. In such cases intraosseous (IO) infusion should be used as the method of choice. However, in practice, different problems are experienced with this procedure. To overcome the practical problems and to confirm the efficacy of IO infusion in reversing hypovolemic shock, an animal model was used by ...
متن کاملSolving Large Scale Crew Scheduling Problems by using Iterative Partitioning
This paper deals with large-scale crew scheduling problems arising at the Dutch railway operator, Netherlands Railways (NS). NS operates about 30,000 trains a week. All these trains need a driver and a certain number of conductors. No available crew scheduling algorithm can solve such huge instances at once. A common approach to deal with these huge weekly instances, is to split them into sever...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Software Tools for Technology Transfer
سال: 2009
ISSN: 1433-2779,1433-2787
DOI: 10.1007/s10009-009-0110-9